/*
 * Copyright (c) 2012, Fredrik Yttergren
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name LucidBot nor the
 *       names of its contributors may be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL Fredrik Yttergren BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

package internal.irc;

import api.irc.communication.IRCOutput;
import api.irc.entities.IRCEntity;

import javax.annotation.ParametersAreNonnullByDefault;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.PriorityQueue;

@ParametersAreNonnullByDefault
public final class WaitingQueuesManager {
    private final Map<IRCEntity, PriorityQueue<IRCOutput>> waitingQueues = new HashMap<>();

    public void add(final IRCOutput output) {
        addQueueForEntityIfAbsent(output.getTarget());
        waitingQueues.get(output.getTarget()).add(output);
    }

    public boolean containsHigherPriority(final IRCOutput output) {
        addQueueForEntityIfAbsent(output.getTarget());
        IRCOutput head = waitingQueues.get(output.getTarget()).peek();
        return head != null && head.compareTo(output) < 1;
    }

    public IRCOutput poll(final IRCEntity entity) {
        addQueueForEntityIfAbsent(entity);
        return waitingQueues.get(entity).poll();
    }

    private void addQueueForEntityIfAbsent(final IRCEntity entity) {
        if (!waitingQueues.containsKey(entity)) waitingQueues.put(entity, new PriorityQueue<IRCOutput>());
    }

    public void clearQueues() {
        for (Collection<IRCOutput> queue : waitingQueues.values()) {
            queue.clear();
        }
    }
}
